[计] 确定性机;
A Method for Path Coverage Testing Based on Deterministic Finite Automata Machine
基于有穷自动机的路径覆盖测试方法
It is proved that the SEE' satisfiability is solvable in the polynomial time by means of giving a concrete deterministic Turing Machine.
通过给出具体的确定型图林机,证明了SBE的可满足性(SAT)问题在多项式时间内可解。
简答网 · 双语娱乐资讯
简答网 · 双语新闻
简答网 · 高考英语